- reflexive and transitive closure
- рефлексивное и транзитивное замыкание
Англо-русский словарь промышленной и научной лексики. 2014.
reflexive and transitive closure
Смотреть что такое "reflexive and transitive closure" в других словарях:
Transitive relation — In mathematics, a binary relation R over a set X is transitive if whenever an element a is related to an element b , and b is in turn related to an element c , then a is also related to c . Transitivity is a key property of both partial order… … Wikipedia
Closure (mathematics) — For other uses, see Closure (disambiguation). In mathematics, a set is said to be closed under some operation if performance of that operation on members of the set always produces a unique member of the same set. For example, the real numbers… … Wikipedia
Reflexive relation — In mathematics, a reflexive relation is a binary relation on a set for which every element is related to itself, i.e., a relation on S where x x holds true for every x in S.[1] For example, could be is equal to . Contents 1 Related terms 2… … Wikipedia
Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y) (cl… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Trace monoid — In mathematics and computer science, a trace is a set of strings, wherein certain letters in the string are allowed to commute, but others are not. It generalizes the concept of a string, by not forcing the letters to always be in a fixed order,… … Wikipedia
Monoid — This article is about the mathematical concept. For the alien creatures in the Doctor Who adventure, see The Ark (Doctor Who). Coherence law for monoid unit In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a… … Wikipedia
Presentation of a monoid — In algebra, a presentation of a monoid (or semigroup) is a description of a monoid (or semigroup) in terms of a set Sigma; of generators and a set of relations on the free monoid Sigma; lowast; (or free semigroup Sigma;+) generated by Sigma;. The … Wikipedia
Common knowledge (logic) — For common knowledge in general, see Common knowledge. Common knowledge is a special kind of knowledge for a group of agents. There is common knowledge of p in a group of agents G when all the agents in G know p, they all know that they know p,… … Wikipedia
Mobile Membranes — Membrane systems have been inspired from the structure and the functioning of the living cells. They were introduced and studied by Gh.Paun under the name of P systems [24]; some applications of the membrane systems are presented in [15].… … Wikipedia
Action algebra — In algebraic logic, an action algebra is an algebraic structure which is both a residuated semilattice and a Kleene algebra. It adds the star or reflexive transitive closure operation of the latter to the former, while adding the left and right… … Wikipedia
